全文获取类型
收费全文 | 687篇 |
免费 | 152篇 |
国内免费 | 37篇 |
出版年
2024年 | 2篇 |
2023年 | 7篇 |
2022年 | 6篇 |
2021年 | 13篇 |
2020年 | 25篇 |
2019年 | 9篇 |
2018年 | 14篇 |
2017年 | 39篇 |
2016年 | 48篇 |
2015年 | 28篇 |
2014年 | 49篇 |
2013年 | 49篇 |
2012年 | 62篇 |
2011年 | 59篇 |
2010年 | 39篇 |
2009年 | 61篇 |
2008年 | 46篇 |
2007年 | 23篇 |
2006年 | 58篇 |
2005年 | 49篇 |
2004年 | 22篇 |
2003年 | 20篇 |
2002年 | 21篇 |
2001年 | 27篇 |
2000年 | 18篇 |
1999年 | 12篇 |
1998年 | 15篇 |
1997年 | 12篇 |
1996年 | 5篇 |
1995年 | 10篇 |
1994年 | 6篇 |
1993年 | 1篇 |
1992年 | 4篇 |
1991年 | 5篇 |
1990年 | 10篇 |
1989年 | 2篇 |
排序方式: 共有876条查询结果,搜索用时 15 毫秒
21.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
22.
针对火炮身管上标记两个点检测调炮精度受制于单个空间点坐标测量精度的问题,提出通过增加身管上标记点的冗余数量来提高调炮精度的检测方法。应用最小二乘原理对多个空间点进行直线拟合,并采用Monte Carlo方法对身管指向的测量精度进行分析。结果表明:标记4个点、5个点、6个点和7个点与标记2个点(传统方法)相比,其身管指向的测量精度分别提高了约6%、18%、19%和21%。该方法适用于对调炮精度检测要求较高的场合,综合考虑工作效率和测量精度这两个因素,推荐标记5个点测量身管指向。 相似文献
23.
融合乘加指令加速快速傅里叶变换计算的向量化方法,通过变换快速傅里叶变换的蝶形单元运算流程,将传统计算方式中独立的乘法和加法操作组合成次数更少的融合乘加操作,使得时间抽取法基2快速傅里叶变换算法的蝶形单元计算的实数浮点操作由原来的10次乘(加)操作减少到6次融合乘加操作,时间抽取法基4快速傅里叶变换算法的蝶形单元计算的实数浮点操作由原来的34次乘(加)操作减少到24次融合乘加操作;优化了蝶形因子的向量访问,减少存储开销。实验结果表明,提出的方法能够显著加速快速傅里叶变换的计算,取得高效的计算性能和效率。 相似文献
24.
针对原有的声矢量阵三阶PARAFAC(平行因子)模型维数高、参数求解过程运算量大的缺点,建立了一种降维的PARAFAC模型。将声矢量阵看作空间共点的声压传感器子阵和振速传感器子阵,计算各子阵输出数据的自协方差,并构造了三阶张量,最后证明该张量满足三阶PARAFAC模型并利用交替迭代算法估计声源参数。仿真和实测数据表明:该方法可以用于多目标方位估计且估计精度优于超分辨率的ESPRIT算法。 相似文献
25.
现代信息化战争是体系与体系的对抗,区域作战联合装备保障成为信息化条件下装备保障的主要方式,实施科学正确的装备保障指挥,进行保障任务分配对于提高保障效益具有非常重要的意义。通过区域作战装备保障任务的特点,依据区域保障要求建立了包括转场时间在内和不同作战方向上作战单元的重要程度不同的装备保障任务分配模型,保证了重要方向上最晚完成保障任务的作战单元保障时间最短和非重要方向上最晚完成保障任务的作战单元保障时间最短。最后,应用遗传算法给出了区域联合作战装备保障任务分配模型的求解方法和步骤,具有一定的科学性和实用性。 相似文献
26.
27.
28.
维修保障是武器装备形成战斗力的关键要素。随着国际形势和美国国内经济、科技等方面的发展变化,美军的维修策略、维修技术以及维修保障信息化等方面也在不断变革。总结了2000年前后至今,美军在维修保障方面的重大变革,对其发展趋势进行了预测,并结合我军装备保障实际,积极探索切实可行的有效对策。 相似文献
29.
Extant literature documents a relationship between military deployment and the risk of an international terrorist attack against citizens of the deploying country. It appears that deployment significantly increases the possibility of terrorist actions in the home country. In particular, if country A decides to send troops to nation B, then citizens of the former country are more likely to fall victim of an attack carried out by a terrorist organisation originating from the latter country. Contributing to this line of literature, we further refine this relationship by distinguishing between regions where the troops are sent as well as by introducing differences between types of deployment. Our results indicate that missions to Asia and the Middle East are more dangerous than missions to other regions as reflected by the terrorist threat in the home country. Robustness tests do however show that the significance of the location variable Asia is predominantly attributed to the mission to Afghanistan. As for types of deployment, only ad hoc missions seem to increase the risk of an attack, whereas no significant results are found for other missions such as operations under UN and NATO flag. Leaving out the missions to Iraq and Afghanistan however also increases the danger resulting from missions by fixed coalitions. Our results find however no evidence that ‘wearing a blue helmet’ increases the probability of a terrorist attack at home. 相似文献
30.